Towards Automatic Detection of Implicit Equality Constraints in Stability Verification of Hybrid Systems
نویسندگان
چکیده
We present a powerful heuristic that detects implicit equality constraints that may occur in the specification of systems of constraints in order to find Lyapunov-based certificates of stability for hybrid systems. A hybrid system is a fusion of systems exhibiting discrete-time as well as continuous-time behavior, e.g. embedded systems within a physical environment. Stability is a property which ensures that a system starting in any possible state will reach a desired state and remain there. Such systems are particularly useful where a certain autonomous operation is required, e.g. keeping a certain temperature or speed of a chemical reaction or steering a vehicle over a predefined track. Stable hybrid systems are extremely valuable because after an error has disturbed their normal operation, they automatically “steer back” to normal operation. Stability can be certified by finding a so-called Lyapunov function. The search for this kind of function usually involves solving systems of inequality constraints. We have identified and implemented a heuristic that detects implicitly specified equality constraints and tries to resolve them by substitution. Keywords—Hybrid Systems; Automatic Verification; Stability; Lyapunov Theory; Optimization; Sums-of-Squares
منابع مشابه
Dwell Time Refinement
The abstraction of a hybrid system by eliminating one or more of its continuous variables is in general too coarse. In this situation, dwell time refinement may be useful. The idea is to impose explicit constraints on the time that may resp. must be spent (or “dwelled”) between successive mode switches. We show how the required constraints can be inferred automatically (with acceptable cost). T...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملA Method and a Tool for Automatic Verification of Region Stability for Hybrid Systems
We propose a model checking method and tool that integrates state abstraction techniques for the automatic proof of a stability property for hybrid systems called region stability. It is based on a new notion of snapshots which yield characteristic discretizations of trajectories. We have implemented the tool and applied it to solve a number of verification problems, including the fully automat...
متن کاملTowards Automatic Convergence Verification of Self-stabilizing Algorithms
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorith...
متن کاملDetermining Effective Features for Face Detection Using a Hybrid Feature Approach
Detecting faces in cluttered backgrounds and real world has remained as an unsolved problem yet. In this paper, by using composition of some kind of independent features and one of the most common appearance based approaches, and multilayered perceptron (MLP) neural networks, not only some questions have been answered, but also the designed system achieved better performance rather than the pre...
متن کامل